翻訳と辞書 |
Block walking : ウィキペディア英語版 | Block walking In combinatorial mathematics, block walking is a method useful in thinking about sums of combinations graphically as "walks" on Pascal's triangle. As the name suggests, block walking problems involve counting the number of ways an individual can walk from one corner A of a city block to another corner B of another city block given restrictions on the number of blocks the person may walk, the directions the person may travel, the distance from A to B, et cetera. ==An example block walking problem==
Suppose such an individual, say "Fred", must walk exactly ''k'' blocks to get to a point B that is exactly ''k'' blocks from A. It is convenient to regard Fred's starting point A as the origin, , of a rectangular array of lattice points and B as some lattice point , e units "East" and ''n'' units "North" of A, where and both and are nonnegative.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Block walking」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|